منابع مشابه
Representation Theorems for Quantales
In this paper we prove that any quantale Q is (isomorphic to) a quantale of suitable relations on Q. As a consequence two isomorphism theorems are also shown with suitable sets of functions of Q into Q. These theorems are the mathematical background one needs in order to give natural and complete semantics for (non-commutative) Linear Logic using relations. 1991 Mathematics Subject Classificati...
متن کاملRelational Representation Theorem for Powerset Quantales
(Q,≦,∨) is a complete join semilattice (Q,・,e) is a monoid (∨S)・a=∨{b・a | b∈S} for a∈Q, S⊆Q a・(∨S)=∨{a・b | b∈S} for a∈Q, S⊆Q 2 Background: An Example of Quantale (Rel(A),≦,∨,・,e) is a quantale where Rel(A) is the set of all binary relations on A ≦ is the inclusion ∨ is the union ・ is the composition Q・R={ (a,c) | ∃b. (a,b)∈Q, (b,c)∈R } e is the identity relation 3 Our Goal: Relational Represent...
متن کاملRelational Representation of Groupoid Quantales
In Palmigiano and Re (J Pure Appl Algebra 215(8):1945–1957, 2011), spatial SGF-quantales are axiomatically introduced and proved to be representable as sub unital involutive quantales of quantales arising from set groupoids. In the present paper, spatial SGF-quantales of this class are shown to be optimally representable as unital involutive quantales of relations. The results of the present pa...
متن کاملRepresentation Theorems for Hypergraph Satisfiability
Given a set of propositions, one can consider its inconsistency hypergraph. Then the satisfiability of sets of clauses with respect to that hypergraph (see [1], [6]) turns out to be the usual satisfiability. The problem is which hypergraphs can be obtained from sets of formulas as inconsistency hypergraphs. In the present paper it is shown that this can be done for all hypergraphs with countabl...
متن کاملRepresentation Theorems for Petri Nets
This paper retraces, collects, summarises, and mildly extends the contributions of the authors — both together and individually — on the theme of representing the space of computations of Petri nets in its mathematical essence.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Logic Quarterly
سال: 1994
ISSN: 0942-5616,1521-3870
DOI: 10.1002/malq.19940400205